Welcome to the 6 th COLOGNE TWENTE WORKSHOP ON GRAPHS

This volume collects the extended abstracts of the contributions that have been selected for presentation at the Workshop. As it was the case with previous workshops, we are planning to edit a special , fully refereed, proceedings volume with Discrete Applied Mathematics or Discrete Optimization and hereby invite all participants to submit full-length papers relating to the topics of the Workshop. We thank Dini Heres-Ticheler for her help. We gratefully acknowledge the A latency problem with profits U. Faigle, B. Peis 33 A two-phase greedy algorithm for modular lattice polyhedra J.F. Feng 39 A characterization for jump graphs containing complementary cycles A local tournament contains a vertex whose out-arcs are g-pancyclic L. Liberti 103 A useful characterization of the feasible region of binary linear programs V. Lozin, M. Milani˘ c 107 On the maximum independent set problem in subclasses of planar and more general graphs